A lattice path approach to counting partitions with minimum rank t
نویسندگان
چکیده
منابع مشابه
A lattice path approach to counting partitions with minimum rank t
In this paper, we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t6 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 − t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve. c © 2002 Elsevier Science B.V. ...
متن کاملA lattice path approach to counting partitionswith minimum
In this paper we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 ? t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve.
متن کاملA lattice path approach to counting
In this paper we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 ? t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve.
متن کاملA note on a lattice path approach to countingpartitions with minimum rank tAlexander
In this paper we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2 ? t. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve.
متن کاملTalmudic Lattice Path Counting
Consider all planar walks, with positive unit steps (1, 0) and (0, 1), from the origin (0, 0) to a given point (a, b). Let L be the line joining the beginning to the end, i.e., the line b x a y = 0. Call the region below L "downtown," and the region above L "uptown," the line L being the border-line between downtown and uptown. Each such walk has a + b 1 points, not counting the endpoints. For ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2002
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00225-4